Equitable facto rtzations of Hamming shells *
نویسنده
چکیده
We construct a l-factorizalion of the complement .E, of the linear Hamming code of length m:m,--2'-l in the z-cube Q^, for r ) 2,havitg the following equitable property: its component l-factors intersect each Cayley parallel l-factor of Q^ at a constant number of edges, (namely 2mr-r-t edges). In the way to that construction, we flnd an equitable m,-t-factorization of 2, formed by two factors Q,,Q',, speciflcally two spanning regular subgraphs, self-complementary in .E,. These results were already known for r ( 3, where fu and Q! coincide with the so-called Foster graph. @ 2002 Elsevier Science B.V. A11 rights reserved.
منابع مشابه
Equitable factorizations of Hamming shells
We construct a 1-factorization of the complement Σm of the linear Hamming code of length m = mr = 2 r − 1 in the m-cube Qm, for r ≥ 2, having the following equitable property: its component 1-factors intersect each Cayley parallel 1-factor of Qm at a constant number of edges, (namely 2r edges). In the way to that construction, we find an equitable mr−1-factorization of Σm formed by two factors ...
متن کاملOn the binary codes with parameters of triply-shortened 1-perfect codes
We study properties of binary codes with parameters close to the parameters of 1-perfect codes. An arbitrary binary (n = 2 − 3, 2n−m−1, 4) code C, i.e., a code with parameters of a triply-shortened extended Hamming code, is a cell of an equitable partition of the n-cube into six cells. An arbitrary binary (n = 2−4, 2, 3) codeD, i.e., a code with parameters of a triply-shortened Hamming code, is...
متن کاملComputation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کاملInverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance
Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...
متن کاملUsing New Techniques and Devices within the Set of Tiba Body Roller Hamming Robots
In this article, new techniques and technologies have been tried and tested in the installation and commissioning of Roller Home industrial robots, in order to produce a Tiba car with a focus on cost reduction. Due to the fact that press equipment for automobile parts requires a lot of expenses, it was decided to use robots with the same function of roller to reduce costs and increase the q...
متن کامل